Artificial Weed Colonies with Neighbourhood Crowding Scheme for Multimodal Optimization

نویسندگان

  • Ratul Majumdar
  • Ankur Ghosh
  • Aveek Kumar Das
  • Souvik Raha
  • Koushik Laha
  • Swagatam Das
  • Ajith Abraham
چکیده

Multimodal optimization is used to find multiple global & local optima which is very useful in many real world optimization problems. But often evolutionary algorithms fail to locate multiple optima as required by the system. Also they fail to store those optima by themselves. So we have to use other selection scheme that can detect & store multiple optima along with evolutionary algorithms. Hence we use niching which is a very powerful tool in detecting & storing multiple optima. Niching methods were introduced to EAs to allow maintenance of a population of diverse individuals so that multiple optima within a single population can be located .Crowding which is a very primitive branch of niching is used here as the selection scheme with Invasive Weed Optimization (IWO) which is a ecologically inspired algorithms depicting behaviors of plants . For multimodal optimization the total search space is divided into several niches in which separately IWO is applied to find the optima in niches. The niches will also store this optima within themselves.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multimodal Optimization using Crowding Differential Evolution with Spatially Neighbors Best Search

Many real practical applications are often needed to find more than one optimum solution. Existing Evolutionary Algorithm (EAs) are originally designed to search the unique global value of the objective function. The present work proposed an improved niching based scheme named spatially neighbors best search technique combine with crowding-based differential evolution (SnbDE) for multimodal opt...

متن کامل

Multimodal optimization by artificial weed colonies enhanced with localized group search optimizers

Multimodal optimization aims at finding multiple global and local optima (as opposed to a single solution) of a function, so that the user can have a better knowledge about different optimal solutions in the search space and as and when needed, the current solution may be switched to another suitable one while still maintaining the optimal system performance. Evolutionary Algorithms (EAs) due t...

متن کامل

Crowding clustering genetic algorithm for multimodal function optimization

Interest in multimodal function optimization is expanding rapidly since real-world optimization problems often require location of multiple optima in a search space. In this paper, we propose a novel genetic algorithm which combines crowding and clustering for multimodal function optimization, and analyze convergence properties of the algorithm. The crowding clustering genetic algorithm employs...

متن کامل

Fuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization

In the last decades, many efforts have been made to solve multimodal optimization problems using Particle Swarm Optimization (PSO). To produce good results, these PSO algorithms need to specify some niching parameters to define the local neighborhood. In this paper, our motivation is to propose the novel neighborhood structures that remove undesirable niching parameters without sacrificing perf...

متن کامل

Adaptively Choosing Neighbourhood Bests Using Species in a Particle Swarm Optimizer for Multimodal Function Optimization

This paper proposes an improved particle swarm optimizer using the notion of species to determine its neighbourhood best values, for solving multimodal optimization problems. In the proposed speciesbased PSO (SPSO), the swarm population is divided into species subpopulations based on their similarity. Each species is grouped around a dominating particle called the species seed. At each iteratio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011